A note on the recursive unsolvability of primitive recursive arithmetic
نویسندگان
چکیده
منابع مشابه
Formalized Interpretability in Primitive Recursive Arithmetic
Interpretations are a natural tool in comparing the strength of two theories. In this paper we give a brief introduction to the topic of interpretability and interpretability logics. We will focus on the, so far, unknown interpretability logic of PRA. One research technique will be treated. This technique can be best described as restricting the realizations in the arithmetical semantics. 1 Wha...
متن کاملRecursive Unsolvability of a Problem of Thue
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملA note on recursive optimization
This paper presents a new and efficient approach for optimization and implementation of filter banks e.g. velocity channels, orientation channels and scale spaces. The multi layered structure of a filter network enable a powerful decomposition of complex filters into simple filter components and the intermediary results may contribute to several output nodes. Compared to a direct implementation...
متن کاملA Note on Recursive Functions
In this paper, we propose a new and elegant deenition of the class of recursive functions, analogous to Kleene's deenition but diiering in the primitives taken, thus demonstrating the computational power of the concurrent programming language in-The deenition can be immediately rephrased for any distributive graph in a count-ably extensive category with products, thus allowing a wide, natural g...
متن کاملA class of Recursive Permutations which is Primitive Recursive complete
We focus on total functions in the theory of reversible computational models. We define a class of recursive permutations, dubbed Reversible Primitive Permutations (RPP) which are computable invertible total endo-functions on integers, so a subset of total reversible computations. RPP is generated from five basic functions (identity, negation, successor, predecessor, swap), two notions of compo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1966
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1966-0189988-4